Satellite communications and multigraph edge-coloring
نویسندگان
چکیده
An overview of satellite communication scheduling and its relation to edge-coloring of multigraphs is given. Then a theorem about a restricted class of multigraphs is proved to obtain conditions for scheduling in a satellite communications network of practical interest Some limitations of the multigraph model are then discussed.
منابع مشابه
Approximating Maximum Edge Coloring in Multigraphs
We study the complexity of the following problem that we call Max edge t-coloring : given a multigraph G and a parameter t, color as many edges as possible using t colors, such that no two adjacent edges are colored with the same color. (Equivalently, find the largest edge induced subgraph of G that has chromatic index at most t). We show that for every fixed t ≥ 2 there is some > 0 such that i...
متن کاملInterval edge-colorings of cubic graphs
An edge-coloring of a multigraph with colors 1, is called an interval coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this paper we prove that if is a connected cubic multigraph (a connected cubic graph) that admits an interval coloring, then G 2, , t ... t −
متن کاملEdge-coloring series-parallel multigraphs
We give a simpler proof of Seymour’s Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colored with a given number of colors.
متن کاملOn the list chromatic index of nearly bipartite multigraphs
Galvin ([7]) proved that every k-edge-colorable bipartite multigraph is kedge-choosable. Slivnik ([11]) gave a streamlined proof of Galvin's result. A multigraph G is said to be nearly bipartite if it contains a special vertex Vs such that G Vs is a bipartite multigraph. We use the technique in Slivnik's proof to obtain a list coloring analog of Vizing's theorem ([12]) for nearly bipartite mult...
متن کاملOn Interval Non-Edge-Colorable Eulerian Multigraphs
An edge-coloring of a multigraph G with colors 1, . . . , t is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. In this note, we show that all Eulerian multigraphs with an odd number of edges have no interval coloring. We also give some methods for constructing of interval non-edge-colorable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 5 شماره
صفحات -
تاریخ انتشار 1992